A Brief Proof of the Full Completeness of Shin's Venn Diagram Proof System
نویسنده
چکیده
In a article in the Journal of Philosophical Logic in 1996, “Towards a Model Theory of Venn Diagrams,” (Vol. 25, No. 5, pp. 463–482), Hammer and Danner proved the full completeness of Shin’s formal system for reasoning with Venn Diagrams. Their proof is eight pages long. This note gives a brief 5 line proof of this same result, using connections between diagrammatic and sentential representations.
منابع مشابه
A Brief Determination of Certain Class of Power Semicircle Distribution
In this paper, we give a new and direct proof for the recently proved conjecture raised in Soltani and Roozegar (2012). The conjecture can be proved in a few lines via the integral representation of the Gauss-hypergeometric function unlike the long proof in Roozegar and Soltani (2013).
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملA Sound and Complete Diagrammatic Reasoning System
Simple spider diagrams are a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They extend the systems of Venn-Peirce diagrams investigated by Shin to include lower bounds for the cardinalities of the sets represented by the diagrams. This paper summarises the main syntax and semantics of simple spider diagrams and ...
متن کاملThe Axiomatization of Overriding and Update^
There are only very few natural ways in which arbitrary functions can be combined. One composition operator is override: for arbitrary functions f and g, f > g is the function with domain dom( f) U dom(g) that behaves like f on dom( f) and like g on dom(g) \ dom( f ) . Another operator is update: f[g] has the same domain as f, behaves like f on dom( f) \ dom(g), and like g on dom( f) n dom(g). ...
متن کاملCompleteness Proof Strategies for Euler Diagram Logics
Visual logics based on Euler diagrams have recently been developed, including generalized constraint diagrams and concept diagrams. Establishing the metatheories of these logics includes providing completeness proofs where possible. Completeness has been established for such logics, including Euler diagrams, spider diagrams and a fragment of the constraint diagram logic. In this paper, we ident...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Philosophical Logic
دوره 35 شماره
صفحات -
تاریخ انتشار 2006